Search results for "cluster [track data analysis]"
showing 10 items of 1171 documents
NoC based virtualized FPGA as cloud Services
2016
International audience; Web-based applications are increasingly demanding many computationally intensive services. On the other hand, FPGA-based hardware accelerators(HwAcc) provide good performance in accelerating computationally intensive applications. In addition, some FPGAs support a dynamic partial reconfig-uration (DPR) techniques to virtualize and share the FPGA underlying hardware resources in time multiplexing during run-time to save resource and power consumption. Integrating FPGA in a cloud environment is an indispensable way to improve efficiency and provide acceleration services to demanding users. More importantly, in recent years it was proved that FPGA resources deployed in …
Semantic-based Merging of RSS Items
2009
Merging XML documents can be of key importance in several applications. For instance, merging the RSS news from same or different sources and providers can be beneficial for end-users in various scenarios. In this paper, we address this issue and explore the relatedness measure between RSS elements. We show here how to define and compute exclusive relations between any two elements and provide several predefined merging operators that can be extended and adapted to human needs. We also provide a set of experiments conducted to validate our approach. © Springer Science+Business Media, LLC 2009.
The Hierarchical Agglomerative Clustering with Gower index: a methodology for automatic design of OLAP cube in ecological data processing context
2015
In Press, Corrected Proof; International audience; The OLAP systems can be an improvement for ecological studies. In fact, ecology studies, follows and analyzes phenomenon across space and time and according to several parameters. OLAP systems can provide to ecologists browsing in a large dataset. One focus of the current research on OLAP system is the automatic design of OLAP cubes and of data warehouse schemas. This kind of works makes accessible OLAP technology to non information technology experts. But to be efficient, the automatic OLAP building must take into account various cases. Moreover the OLAP technology is based on the concept of hierarchy. Thereby the hierarchical clustering m…
Cluster matching in time resolved imaging for VLSI analysis
2014
International audience; If scaling has the benefit of enabling manufacturers to design tomorrow's integrated circuits, from the failure analyst point of view it also has the drawback of making devices more complex. The test sequence for modern VLSI can be quite long, with thousands of vector. Dynamic photon emission databases can contain millions of photons representing thousands of state changes in the region of interest. Finding a candidate location where to perform physical analysis is quite challenging, especially if the fault occurs on a single vector. In this paper, we suggest a new methodology to find single vector fault in dynamic photon emission database. The process is applied at …
Scheduling independent stochastic tasks on heterogeneous cloud platforms
2019
International audience; This work introduces scheduling strategies to maximize the expected number of independent tasks that can be executed on a cloud platform within a given budget and under a deadline constraint. The cloud platform is composed of several types of virtual machines (VMs), where each type has a unitexecution cost that depends upon its characteristics. The amount of budget spent during the execution of a task on a given VM is the product of its execution length by the unit execution cost of that VM. The execution lengths of tasks follow a variety of standard probability distributions (exponential, uniform, halfnormal, etc.), which is known beforehand and whose mean and stand…
Scheduling independent stochastic tasks under deadline and budget constraints
2018
This article discusses scheduling strategies for the problem of maximizing the expected number of tasks that can be executed on a cloud platform within a given budget and under a deadline constraint. The execution times of tasks follow independent and identically distributed probability laws. The main questions are how many processors to enroll and whether and when to interrupt tasks that have been executing for some time. We provide complexity results and an asymptotically optimal strategy for the problem instance with discrete probability distributions and without deadline. We extend the latter strategy for the general case with continuous distributions and a deadline and we design an ef…
Automated detection of contextuality proofs with intermediate numbers of observables
2021
<div style=""><font face="arial, helvetica"><span style="font-size: 13px;">Quantum contextuality takes an important place amongst the concepts of quantum computing that bring an advantage over its classical counterpart. For a large class of contextuality </span></font><span style="font-size: 13px; font-family: arial, helvetica;">proofs, aka. observable-based proofs of the Kochen-Specker Theorem, we first formulate the</span></div><div style=""><font face="arial, helvetica"><span style="font-size: 13px;">contextuality property as the absence of solutions to a linear system. Then we explain why </span></font><span style="font-size: 13px; font-family: arial, helvetica…
A Route toward Protein Sequencing using Solid-State Nanopores Assisted by Machine Learning
2022
Solid-State Nanopores made of 2-D materials such as MoS2 have emerged as one of the most versatile sensors for single-biomolecule detection, which is essential for early disease diagnosis (biomarker detection). One of the most promising applications of SSN is DNA and protein sequencing, at a low cost and faster than the current standard methods. The detection principle relies on measuring the relatively small variations of ionic current as charged biomolecules immersed in an electrolyte traverse the nanopore, in response to an external voltage applied across the membrane. The passage of a biomolecule through the pore yields information about its structure and chemical properties, as demonst…
Computer-assisted enumeration and classification of multi-qubit doilies
2022
For N ≥ 2, an N-qubit doily is a doily living in the N-qubit symplectic polar space. These doilies are related to operator-based proofs of quantum contextuality. Following and extending the strategy of [SdBHG21] that focused exclusively on three-qubit doilies, we first bring forth several formulas giving the number of both linear and quadratic doilies for any N > 2. Then we present an effective algorithm for the generation of all N-qubit doilies. Using this algorithm for N = 4 and N = 5, we provide a classification of N-qubit doilies in terms of types of observables they feature and number of negative lines they are endowed with.
A Hirshfeld partitioning of polarizabilities of water clusters
2006
International audience; A new Hirshfeld partitioning of cluster polarizability into intrinsic polarizabilities and charge delocalization contributions is presented. For water clusters, density-functional theory calculations demonstrate that the total polarizability of a water molecule in a cluster depends upon the number and type of hydrogen bonds the molecule makes with its neighbors. The intrinsic contribution to the molecular polarizability is transferable between water molecules displaying the same H-bond scheme in clusters of different sizes, and geometries, while the charge delocalization contribution also depends on the cluster size. These results could be used to improve the existin…